
primes = []
maxn = int(2147483648 ** 0.5) + 1
fac = [True] * maxn
for k in range(2, maxn):
    if fac[k]:
        primes.append(k)
        for kk in range(k + k, maxn, k):
            fac[kk] = False
def isPrime(x: int) -> bool:
    if x < maxn:
        return fac[x]
    for p in primes:
        if p * p > x:
            break
        if x % p == 0:
            return False
    return True

upper = 2147483648 // 7
for t in range(upper, 0, -1):
    if isPrime(t):
        print('Found: ', t)
        break

print('ans: ', 7 ** 119 % 998244353)